An efficient polynomial time approximation scheme for load balancing on uniformly related machines
نویسندگان
چکیده
We consider basic problems of non-preemptive scheduling on uniformly related machines. For a given schedule, defined by a partition of the jobs into m subsets corresponding to the m machines, Ci denotes the completion time of machine i. Our goal is to find a schedule which minimizes or maximizes m
منابع مشابه
A unified framework for designing EPTAS's for load balancing on parallel machines
We consider a general load balancing problem on parallel machines. Our machine environment in particular generalizes the standard models of identical machines, and the model of uniformly related machines, as well as machines with a constant number of types, and machines with activation costs. The objective functions that we consider contain in particular the makespan objective and the minimizat...
متن کاملOnline Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm
Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...
متن کاملTruthful Mechanisms for One-Parameter Agents
In this paper, we show how to design truthful (dominant strategy) mechanisms for several combinatorial problems where each agent’s secret data is naturally expressed by a single positive real number. The goal of the mechanisms we consider is to allocate loads placed on the agents, and an agent’s secret data is the cost she incurs per unit load. We give an exact characterization for the algorith...
متن کاملAn EPTAS for Scheduling on Unrelated Machines of Few Different Types
In the classical problem of scheduling on unrelated parallel machines, a set of jobs has to be assigned to a set of machines. The jobs have a processing time depending on the machine and the goal is to minimize the makespan, that is the maximum machine load. It is well known that this problem is NP-hard and does not allow polynomial time approximation algorithms with approximation guarantees sm...
متن کاملMinimum total weighted completion time: Faster approximation schemes
We study classic scheduling problems on uniformly related machines. Efficient polynomial time approximation schemes (EPTAS’s) are fast and practical approximation schemes. New methods and techniques are essential in developing such improved approximation schemes, and their design is a primary goal of this research agenda. We present EPTAS’s for the scheduling problem of a set of jobs on uniform...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 147 شماره
صفحات -
تاریخ انتشار 2014